MPLS implementation of an ATM platform

ABSTRACT

A method of timing an attempt to establish a connection path between a first and second node in a communications network is provided. The method initiates the attempt to establish a connection path after a period of time has elapsed wherein the period of time is greater than another period of time which had previously elapsed between two previous attempts, if any, to establish the connection.

This application is a continuation of U.S. patent application Ser. No.09/977,984, filed Oct. 17, 2001, the disclosure of which is incorporatedherein by reference.

FIELD OF ART

The invention relates to the art of digital communication systems andmore specifically to an implementation of a network node employingmulti-protocol label switching (MPLS) over an asynchronous transfer mode(ATM) platform.

BACKGROUND OF INVENTION

MPLS is quickly gaining support in the industry as a robust way oftransmitting Internet Protocol (IP) packets. This is primarily becauseMPLS eliminates the need to examine the destination IP address of apacket at every router or network node in the path of the packet. Assuch, MPLS has particular utility in the high speed core of manynetworks. Recognizing that within the high speed core ATM switchinginfrastructure is likely to exist, the industry is presently in theprocess of formulating standards for deploying MPLS over an ATMinfrastructure.

As in the nature of most standardization efforts, the focus has been todefine the functional features necessary to enable interoperabilityamongst equipment manufactured by a variety of participants. However,many problems arise in implementing MPLS functionality. These include:(1) the general management and maintenance of signalled label switchedpaths (SLSP) on an ATM infrastructure; (2) procedures on the failedestablishment of an SLSP; (3) management of signalling links; (4)procedures when a signalling link or physical link fails; and (5)procedures under various changes in network topology, such as thecreation of a new signalling link. The present invention seeks toprovide solutions to these various issues.

SUMMARY OF INVENTION

One aspect of the invention provides a method of managing acommunications network having a plurality of interconnected nodeswherein a connection path is established from an ingress node to anegress node through a plurality of intermediate nodes. The methodincludes: associating the connection path with a network-wide uniqueidentification; storing the path identification on the ingress node soas to indicate that the path originates thereat; storing the pathidentification on each intermediate node so as to indicate that the pathtransits each such intermediate node; and storing the pathidentification on the egress node so as to indicate that the pathterminates thereat.

Preferably, the steps of storing the connection identifier occurs in theprocess of establishing the connection path by signalling a connectionset-up request from the ingress node through the intermediate nodes tothe egress node.

Another aspect of the invention relates to a method of timing an attemptto establish a connection path, such as an SLSP, which has initiallyfailed. This is accomplished by initiating another attempt to establisha connection path after a period of time has elapsed, wherein saidperiod of time is greater than another period of time which hadpreviously elapsed between two previous attempts, if any, to establishsaid connection.

Another aspect of the invention relates to method of timing attempts toestablish connections for a plurality of requests for connections, suchas SLSPS, in a communication network. The method includes: providing atimer arrangement for tracking passage of a regular interval of time;providing a list of records relating to the plurality of requests forconnections; selecting one record from the list; attempting to establisha connection relating to the one record; and if the connection relatingto the one record is established, marking the one record as beingsuccessful, otherwise, re-attempting to establish the connection atsuccessive intervals increasing by the regular interval.

In other aspects, the invention provides various combinations andsubsets of the aspects described above.

BRIEF DESCRIPTION OF DRAWINGS

The foregoing and other aspects of the invention will become moreapparent from the following description of specific embodiments thereofand the accompanying drawings which illustrate, by way of example only,the principles of the invention. In the drawings, where like elementsfeature like reference numerals which may bear unique alphabeticalsuffixes in order to identify specific instantiations of like elements):

FIG. 1 is a system block diagram of a network node which processes ATMcells and IP packets;

FIG. 2 is process flow diagram showing how IP packets are processed inthe node of FIG. 1;

FIG. 3 is a diagram of a forwarding table employed by IP forwardersassociated with input/output controllers of the node of FIG. 1;

FIG. 4 is a diagram of a data structure representing a “serviceinterface” associated with nodes such as shown in FIG. 1;

FIG. 5 is an architectural block diagram of hardware processors andsoftware processes associated with a control card on the node of FIG. 1

FIG. 6 is a master IP routing table associated with an IP network;

FIG. 7 is a diagram of a reference network illustrating an MPLS domainwithin an IP network;

FIG. 8 is a schematic diagram of a database employed by the node of FIG.1 to manage signalled label switched paths (SLSPs);

FIGS. 8A and 8B show certain fields of the database of FIG. 8 in greaterdetail;

FIGS. 9 and 10 are logic flow charts showing the steps executed by thenode of FIG. 1 in establishing an SLSP; and

FIG. 11 is a logic flow chart showing the steps executed by the node inthe event a new SLSP signalling link is established.

DETAILED DESCRIPTION OF ILLUSTRATIVE EMBODIMENT

The description which follows, and the embodiments therein, are providedby way of illustrating an example, or examples, of particularembodiments of principles of the present invention. These examples areprovided for the purpose of explanation, and not limitations, of thoseprinciples. In the description which follows, like elements are markedthroughout the specification and the drawings with the same respectivereference numerals.

1. Overview of ATM Switching

FIG. 1 is an architectural block diagram of an exemplary dual functionATM switch and IP router 10 (hereinafter “node”). The node 10 comprisesa plurality of input/output controllers such as line cards 12 which havephysical interface input/output ports 14. Generally speaking, the linecards 12 receive incoming ATM cells on ports 14. Each ATM cell, inaccordance with standardized ATM communication protocols, is of a fixedsize and incorporates a virtual path identifier (VPI) and a virtualchannel identifier (VCI) so that the cell can be associated with aparticular virtual circuit (VC). For each such cell received, the linecards 12 consult a lookup table or content addressable memory (CAM) 15keyed on VCs. The CAM 15 provides pre-configured addressing informationas to the outgoing port and egress line card for each cell. This isaccomplished by way of an “egress connection index”, which is a pointerto a pre-configured memory location on the egress line card that storesa new VC identifier that should be attributed to the cell as itprogresses its way over the next network link. The ingress line cardattaches the addressing information and egress connection index to eachcell and sends it to a switching fabric 20 which physically redirects orcopies the cell to the appropriate egress line card. The egress linecard subsequently performs the pre-configured VPI/VCI field replacementand transmits the cell out of the egress port. Further details of thistype of ATM switching mechanics can be found in PCT publication no.WO95/30318, all of which is incorporated herein by reference.

The node 10 also features a control card 24 for controlling andconfiguring various node functions, including routing and signallingfunctions, as described in much greater detail below. The line cards 12may send data received at ports 14 to the control card 24 via theswitching fabric 20.

Each line card supports bidirectional traffic flows (i.e., can processincoming and outgoing packets). However for the purposes of descriptionthe following discussion assumes that line card 12A and ports 14A1 and14A2 provide ingress processing and line cards 12B, 12C and ports 14B1,14B2, 14C1, 14C2 provide egress processing for data traffic flowing fromleft to right in FIG. 1.

2. Overview of IP Routing

The node of the illustrated embodiment also enables variable lengthpackets of digital data associated with a hierarchically highercommunications layer, such as Internet Protocol (IP), to be carried overthe ATM transport layer infrastructure. This is made possible bysegmenting each variable length packet into a plurality of ATM cells fortransport. Certain VCs may thus be dedicated to carrying IP packets,while other VCs may be exclusively associated with native ATMcommunications.

When a cell arrives at ingress port 14A1 the line card 12A accesses CAM15A to obtain context information for the VC of the arriving cell, aspreviously described. The context information may associate the VC witha “service interface”. This is an endpoint to a link layer (i.e. “layer2”) path, such as an AAL5 ATM path, through a network. A number ofservice interfaces (SIs) may exist on each I/O port 14. These serviceinterfaces “terminate” at an IP forwarder 22 on the same line card inthe sense that, as subsequently described, the ATM cells constituting anIP packet are reassembled into the packet, following which IP forwardingprocedures (as opposed to ATM switching procedures) are followed.

The essence of IP forwarding is that an IP packet received at one SI isre-transmitted at another SI. Referring additionally to the process flowchart shown in FIG. 2, the forwarding process for IP packets can belogically divided into three transport stages, separated by twoprocessing stages, through the node.

The first transport stage, schematically represented by arrows 16A,carries ATM cells associated with an ingress SI from the ingress port14A1 to the ingress IP forwarder 22A.

The second transport stage carries IP packets from the ingress IPforwarder 22A across the switching fabric 20 to an egress IP forwarder,e.g., forwarder 22B. This second transport stage is implemented via a“connection mesh” 21. Within the connection mesh eight internalconnections or transport interfaces (TIs) 18 are set up between eachpair of IP forwarders 22 (only three TIs are shown). The TIs areprovided so as to enable different levels or classes of service (COS)for IP packets.

The third transport stage, schematically represented by arrows 16B,carries IP packets from the egress IP forwarder 22B to the egress port,e.g. port 14B1, and egress SI.

The first processing stage occurs at the ingress IP forwarder 22A, wherethe ATM cells associated with an ingress SI are reassembled into IPpackets. This is shown as step “A” in FIG. 2. At step “B” the IPforwarder 22A then examines the destination IP address of the packet inorder to determine the appropriate egress SI for the “next hop” throughthe network. This decision is based on an IP forwarding table 30(derived from IP protocols, as discussed in greater detail below) shownschematically in FIG. 3. Each record of table 30 includes an IP addressfield 32 and an “egress interface index” field 36. The IP destinationaddress of the packet is looked up in the IP address field 32 to findthe longest match thereto (i.e., the table entry which resolves thepacket IP address destination as far as possible). The correspondingegress interface index essentially specifies the egress line card 12B,egress IP forwarder 22B, and the egress SI for the packet (see moreparticularly the discussion with reference to FIG. 8A). The egressinterface index is attached to the IP packet.

In addition, at step “C” the IP forwarder 22A examines the class ofservice (COS) encapsulated by the packet. Based partly on theencapsulated COS and internal configuration, the IP forwarder 22Aselects one of the second-stage TIs 18 which will reach the egressforwarder 22B with a desired class of service. In order to traverse theswitching fabric 20, the ingress IP forwarder 22A re-segments the IPpacket into ATM cells (shown schematically as step “D”) and attachesaddressing information to each cell indicating that its destination isthe egress IP forwarder 22B.

The second, smaller, processing stage occurs at the egress IP forwarder22B, where the egress interface index is extracted from the packet andit is modified at step “E” to match the encapsulation associated withthe egress SI. Thus, the VPI/VCI associated with the egress SI isattached to the packet. The packet is then delivered to that egress SI(labelled “G”) using the third-stage transport 16B correspondingthereto. In this process the packet is segmented once again into ATMcells which are buffered in cell queues associated with the egress SIand/or output port 14B1. A queuing and possible congestion point(labelled “F”) also occurs between the second processing and thirdtransport stage—that is, between the egress IP forwarding module 22B andthe egress SI (labelled “G”).

It will be seen from the foregoing that effecting IP forwardingfunctionality on an ATM platform is a relatively involved process,requiring that the IP packet be: (a) reassembled at the ingress IPforwarder 22A, (b) subsequently segmented for transport over theswitching fabric, (c) re-assembled at the egress forwarder 22B, and (d)subsequently re-segmented for transmission out of the output port. Inaddition, a non-trivial IP address lookup has to be performed at theingress forwarder 22A. These steps have to be performed at each networknode and hence increase the latency of end-to-end communication.

3. Introduction to MPLS

In order to avoid having to perform the above procedures on each andevery packet, the node 10 provides multi-protocol label switching (MPLS)capability. In conventional IP forwarding, routers typically considertwo packets to be in the same “forward equivalency class” (FEC) if thereis some address prefix in that router's tables which is the longestmatch for the destination address of each packet. Each routerindependently re-examines the packet and assigns it to a FEC. Incontrast, in MPLS a packet is assigned to a FEC only once as the packetenters an MPLS domain, and a “label” representing the FEC is attached tothe packet. When MPLS is deployed over an ATM infrastructure, the labelis a particular VC identifier. At subsequent hops within an MPLS domainthe IP packet is no longer examined. Instead, the label provides anindex into a table which specifies the next hop, and a new label. Thus,at subsequent hops within the MPLS domain the constituent ATM cells of apacket can be switched using conventional ATM switching techniques. Suchpaths are known in the art as label switched paths (LSPs), and LSPs maybe manually set up as permanent label switched paths (PLSP) by networkoperators. Alternatively, a label distribution protocol (LDP) may beemployed wherein the network automatically sets up the path upon commandfrom the network operator. Such paths are typically referred to in theart as soft-permanent or signalled LSPs (SLSPs). Further detailsconcerning MPLS can be found in the following draft (i.e. work inprogress) MPLS standards or proposals, each of which is incorporatedherein by reference:

-   [1] E. Rosen, A. Viswanathan, R. Call on, Multiprotocol Label    Switching Architecture, draft ietf-mpls-arch-06.txt.-   [2] L. Andersson, P. Doolan, N. Feldman, A. Fredette, B. Thomas, LDP    Specification, draft-ietf-mpls-ldp-06.txt. This LDP is hereinafter    referred to as “LDP Protocol”.-   [3] B. Davie, J. Lawrence, K. McCloghrie, Y. Rekhter, E. Rosen, G.    Swallow, P. Doolan, MPLS Using LDP and ATM VC Switching,    draft-ietf-mpls-atm-02.txt.-   [4] B. Jamoussi, Constraint-Based LSP Setup using LDP,    draft-ietf-mpls-cr-ldp-01.txt. This LDP is hereinafter referred to    as “CRLDP”.-   [5] E. Braden et al., Resource Reservation Protocol, RFC 2205. This    LDP is hereinafter referred to as “RSVP”.

The node 10 implements MPLS functionality through an SI linkage, as willbe better understood by reference to FIG. 4 which shows the SI in thecontext of a management entity or record. The SI has an internal IDnumber associated therewith. In addition to representing an ATM linklayer endpoint, the SI also represents an IP address for layer 3functionality, and indicates what type of encapsulation is used for IPpurposes. Each SI may also be associated with a number of otherattributes and methods. In particular, SIs can be associated with thefollowing methods or applications: (1) IP forwarding, (2) MPLSforwarding, (3) IP routing, and (4) MPLS signalling. In other words, thenode 10 can be configured to (1) forward IP data packets to the next hoprouter via the above described IP forwarding procedures discussed above;(2) forward IP data packets via MPLS forwarding procedures as will bediscussed below; (3) process packets carrying messages for IP routingprotocols; and (4) process packets carrying messages for MPLS signallingprotocols.

4. Overview of MPLS Architecture

FIG. 5 shows the hardware and software architecture of the control card24 in greater detail. From the hardware perspective, the card 24 employsa distributed computing architecture involving a plurality of discretephysical processors (which are represented by rectangular boxes in thediagram).

Processor 50 handles layer 2 (“L2”) ATM adaptation layer packetsegmentation and reassembly functions for signalling messages. Asmentioned, certain SIs will be associated with various types of routingprotocols and upon receipt of a packet associated with one of these SIsthe ingress IP forwarder 22A sends the packet (which is re-segmented totraverse the switching fabric 20) to the L2 processor 50. Afterre-assembly, the L2 processor 50 sends signalling messages associatedwith IP routing protocols to a software task termed “IP Routing” 68which executes on a routing processor 58. (The connection between the L2processor 50 and IP Routing 68 is not shown). Signalling messagesassociated with MPLS LDP protocols are sent to a label management systemtask (LMS) 64 executing on a layer 3 (L3) processor 54. Outgoingmessages from the LMS 64 and IP Routing 68 are sent to the L2 processor50 for subsequent delivery to the appropriate egress line card andegress SI.

IP Routing 68 runs an IP interior gateway or routing protocol such asI-BGP, ISIS, PIM, RIP or OSPF. (The reader is referred tohttp://www.ietf.org./html.charters/w-dir.html for further informationconcerning these protocols.) As a result of these activities IP Routing68 maintains a master IP routing table 75 schematically shown in FIG. 6.Each record of the master table 75 includes a field 75 a for an IPaddress field, a field 75 b for the next hop router ID (which is an IPaddress in itself) corresponding to the destination IP address or aprefix thereof, and a list 75 c of egress interface indexes associatedwith the next hop router ID. As the network topology changes, IP Routingwill update the forwarding tables 30 of IP forwarders 22 by sending theappropriate egress interface index to it. (Note that table 30 only hasone egress interface index associated with each IP destination addressentry.)

As shown in FIG. 5, the node 10 employs a plurality of L3 processors 54,each of which includes an LMS 64. Each LMS 64 terminates the TCP and UDPsessions for the LDP signaling links (LDP Session) and runs a statemachine for each LSP. As discussed in greater detail below, the LMS 64receives requests to set up and tear down LDP Sessions, and to set upand tear down SLSPs.

The LMS 64 is commercially available from Harris & Jeffries of Dedham,Mass. For intercompatibility purposes, the node 10 includes“translation” software, the MPLS context application manager (MPLS CAM)65, which translates and forwards incoming or outgoingrequests/responses between the LMS and the remaining software entitiesof the control card 24.

Each L3 processor 54 also includes a call-processing task 72. This taskmaintains state information about connections which have been requested.

Another processor 56 provides user interface functionality, includinginterpreting and replying to administrative requests presented through acentral network management system (NMS) (such as the Newbridge NetworksCorporation 46020™ product) or through command instructions provideddirectly to the node via a network terminal interface (NTI). For MPLSfunctionality, a user interface 66 is provided for accepting andreplying to management requests to program PLSPs, SLSPs, and LDPSessions.

A resource control processor 52 is provided for allocating andde-allocating resources as connections are established in the node. ForMPLS functionality, processor 52 includes a label manager task 62 whichallocates unique label values for LSPs.

On the routing processor 58, a software task termed “MPLS Routing” 70interfaces between the UI 66, IP Routing 68 and the LMSs 64 running onthe L3 processors 54. Broadly speaking, MPLS Routing 70 manages SLSPs.For example, during path setup, MPLS Routing 70 receives an SLSP setuprequest from the user interface 66, retrieves next hop routinginformation from IP Routing 68, chooses an LDP Session to the next hop,and calls the appropriate instantiation of the LMS 64 to set up the SLSPpath using the selected LDP Session. When a label mapping is receivedfor the path, the LMS 64 informs MPLS Routing 70. MPLS Routing 70 thentriggers an update to the forwarding tables 30 of the IP forwarders 22for the new path. Similarly, when the network topology changes, MPLSRouting 70 reflects these changes into the MPLS routing domain. Thefunctions of MPLS Routing are the focus of the remainder of thisdescription.

5. Reference Network

FIG. 7 shows a reference IP network 80 wherein an MPLS routing domainexists amongst routers/nodes A, B and C, the remaining of the network 80employing IP specific routing protocols such as OSPF. Assume the networkoperator wishes to establish an SLSP, commencing from node A, for IPdestination address 1.2.3.4 (hereinafter “FEC Z”) located somewhere inthe network. (Note that a FEC, as per the draft MPLS standards,comprises a destination IP address and a prefix thereof.) The networkoperator may enter a management command at node A via its NMTI or theNMS (not shown) requesting the establishment of a SLSP for FEC Z.Depending on the type of label distribution protocol employed (e.g., LDPProtocol, CRLDP, or RSVP) the network operator may specify thedestination node for the SLSP, or even explicitly specify the desiredroute for the SLSP up to some destination node (i.e., a source-routedSLSP). In the further alternative, the label distribution protocol mayuse a best effort policy (e.g., in LDP Protocol) to identify nodes(within the MPLS routing domain) as close as possible to the destinationaddress of FEC Z. In the illustrated reference network, assume that nodeC is the “closest” node within the MPLS routing domain for FEC Z.

In the network 80, signalling links 82 (which are associated withparticular SI's) are provided for communicating IP routing messagesbetween the nodes. In addition, signalling links 84 are provided forcommunicating MPLS label distribution protocol messages therebetween.Each signalling link 84 has an LDP Session associated therewith.

For the purposes of nomenclature, unless the context dictates otherwise,the term “ingress SLSP” is used to identify the SLSP at the originatingnode (e.g., node A), the term “transit SLSP” is used to identify theSLSP at transiting nodes (e.g., node B), and the term “egress SLSP” isused to identify the SLSP at the destination node (e.g., node C).

The reference IP network shown in FIG. 7 is used to provide the readerwith a typical application which will help to place the invention incontext and aid in explaining it. Accordingly, the invention is notlimited by the particular application described herein.

6. Database Management of SLSPs

In order to create, monitor and keep track of ingress, transit andegress SLSPs, MPLS Routing 70 maintains a number of tables or datarepositories as shown in the database schema diagram of FIG. 8. Sinceeach SLSP is managed by an LDP Session, MPLS Routing 70 on each nodekeeps track of the various LDP Sessions which have been set up betweenthe node and its LDP peer routing entities using an LDP signallingdatabase (LSLT) 100. The LSLT 100 comprises a hash table 102 having oneentry or record 104 per LDP routing peer. Record 104 contains a routerid field 104 a which functions as the index for the hash table 102 and apointer 104 b (i.e., *ldp_session_list) which points to an LDP sessionlist 106. The router id field 104 a stores the IP address of the LDPpeer router to which one or more LDP Sessions have been configured. EachLDP Session is represented by an entry or record 108 in the pointed-toLDP session list 106. Note that multiple LDP Sessions can be configuredbetween the node and a given MPLS peer router and hence the session list106 can have multiple entries or records 108. In FIG. 8, two LDPSessions have been configured with respect to the LDP peer routeridentified by the illustrated router id field 104 a, and hence tworecords 108 exist in the corresponding LDP session list 106.

Each record 108 of the LDP session list 106 comprises the followingfields:

-   -   if Index (108 a)—A unique number within the node 10 which        identifies a particular interface index and SI which has been        configured for the LDP application. FIG. 8A shows the structure        of the if Index field in greater detail. It comprises a        node-internal device address for the line card/IP module        responsible for the SI, the egress port, the SI ID number (which        is only unique per line card) and an identification code or        internal device address for the L3 processor 54 on the control        card 24 handling the LDP signalling link.    -   *fit_list entry (108 b)—A pointer to a FEC information table        (FIT) 110. The FIT, as described in greater detail below, keeps        track of all ingress SLSPs stemming from the node. The        fit_list_entry pointer 108 b points to a list within FIT 110 of        the ingress SLSPs associated with this LDP Session.    -   ldp_status (108 c)—A status indication. The status includes a        one bit flag (not shown) indicating whether or not the LDP        Session is in use and a one bit flag (not shown) indicating        whether resources are available for the LDP Session. An LDP        Session is considered to have no resources available when there        are no labels available for allocation or when the associated SI        becomes non-operational.    -   *next_ldp_session—A pointer to another LDP Session record 108        associated with the same LDP peer router.

The FIT 110 keeps track of ingress SLSPs, i.e., SLPs which havecommenced from the node. (Note that the FIT 110 does not keep track oftransit or egress SLSPs) A FIT entry or record 112 is created by MPLSRouting 70 when an SLSP is configured and record 112 is removed from theFIT 100 when an SLSP is deleted.

Each FIT entry or record 112 comprises the following elements:

-   -   **prev_fitEntry (112 a)—A pointer to a pointer which references        the current entry. This is used for ease of addition and removal        from a list.    -   FEC—IP destination for an LSP. The FEC consists of an IP        destination address 112 b and a prefix 112 c for which the LSP        is destined, as per the draft standards.    -   Srt_index (112 d)—An index into a source-route table or list        (SRT) 114. This takes on the value 0 if the LSP is not        source-routed and >0 if it is. In the event the SLSP        establishment command includes a source routed path, the router        ID IP addresses are stored in the SRT 114 in sequential order,        as shown.    -   if Index (112 e)—Specifies the egress line card and egress SI        used to reach the next hop router for the FEC. The structure of        this field is the same as shown in FIG. 8A. Note, however, that        in the FIT 110 this field 112 e specifies the SI for the egress        data path (as opposed to signaling channel) for the FEC.    -   fecStatus (112 f)—The state of this FIT entry as represented        (see FIG. 8B) by a ttl value, an ingressSetup flag, a retrySeq        counter, and a rertySec counter. The ttl value indicates a time        to live value that should be decremented from the incoming        packets. The ingresSetup flag indicates that the SLSP is        successfully established. The retrySeq counter keeps track of        the number of times MPLS. Routing has tried to set up this SLSP,        as described in greater detail below. The retrySec counter keeps        track of how many seconds are left until the next retry is        attempted.    -   lsp_id (112 g)—A unique identifier used to identify an SLSP        within an MPLS domain. In the present embodiment the identifier        comprises a concatenation of the node's IP router ID plus a        unique number selected by the UI 66 to uniquely identify the LSP        within the node. The lsp_id is also used as a hash key for the        FIT 110.    -   *RWTptr (112 h)—A pointer to a route watch database (RWT) 120        described in greater detail below.    -   Next.RTLPtr (112 i), prev.RTLPtr(112 j)—Forward and backward        pointers used to keep track of FIT entries 112 in which the        ingressSetup flag of the fecStatus field 112 f indicates that        the corresponding SLSP has not been successfully set up. These        pointers are basically used to implement a retry list (RTL) 116        which is embedded in the FIT 110. For example, the FIT entries        112 labelled “A” and “B” form part of the RTL 116. The RTL thus        enables the node to quickly traverse the FIT 110 to find pending        SLSPs for all peer routers.    -   *next_fitEntry (112 k)—A pointer to the next FEC/FIT entry which        has been set up using the same LDP Session as the current        FEC/FIT entry.

The RWT 120 keeps track of all SLSPs handled by the node, i.e., ingress,transit and egress SLSPs. The RWT 120 comprises a hash table 122 whichincludes an IP designation address field 122 a, an IP prefix field 0122b, and a *rwt-entry 122C which points to a list 124 of LSPs described ingreater detail below.

The IP destination address and prefix fields 122 a and 122 b are used tostore different types of management entities depending on the particularlabel distribution protocol employed. These entities may be: (a) theFEC, for LDP Protocol; (b) the destination node's router ID, for nonsource-routed RSVP; (c) the next node's router ID for strictsource-routed CR-LDP and RSVP; and (d) the next hop in the configuredsource-route for loose source-routed CR-LDP and RSVP. These can all besummarized as the next hop that an SLSP takes through the network.

Note that table 122 is hashed based on the IP prefix field 122 b. Therecan be several requested SLSPs all referring to the same IP prefix at atransit node or egress node. Each individual SLSP is identified by aseparate entry or record 126 in the LSP list 124. However, there canonly be one ingress SLSP associated with any given IP prefix on the node10. (In other words, an entry 126 exists for every next hop requestreceived from the LMS 64 as well as one entry for an ingress SLSP whichhas been created on the node. Note too that egress SLSPs also requestnext hop information and therefore are included within this table).

Each LSP list entry 126 comprises the following elements:

-   -   prev_RwtPtr (126 a), next_RwtPtr (126 f). Forward and backward        pointers used to keep track of additional entries 126 for a        specific IP prefix. All of the LSPs associated with the same IP        prefix 122 b are linked together using pointers 126 a and 126 f    -   next_EgressPtr (126 b), prev_EgressPtr (126 c)—Forward and        backward pointers used to keep track of egress SLSPs which may        possibly be extended when a new LDP Session is configured, as        discussed in greater detail below. These pointers are basically        used to implement an LSP egress table or list (LET) 130 which is        embedded in the RWT 120. For example, in FIG. 8 the RWT entries        126 labelled “X” and “Y” belong to the LET 130. An entry 126 is        added to the LET 130 whenever a best effort routing policy        (e.g., LDP Protocol) is employed in setting up an SLSP and the        node 10 can find no further LDP signalling links “closer” to the        destination address of the corresponding FEC. For example, in        establishing an SLSP for FEC Z in the reference network, node C        (which lies at the boundary of the MPLS routing domain) cannot        find any more LDP signalling links heading towards the        destination address of FEC Z, and thus when node C creates a RWT        entry 126 for this SLSP the entry will be added to the LET.    -   fitEntryPtr (126 d)—Pointer to the FIT entry 112 which        corresponds to this RWT entry 126. The value of this field will        be null for all entries except for ingress SLSPs created at this        node.    -   L3_id (126 e)—The address or identity of the L3 processor which        initially requested the next hop request for the LSP or the        address or identity of the L3 processor which is used to set up        an ingress SLSP.    -   lsp_id (126 g)—Same as lsp_id 112 g in FIT 110, except that        these LSPs may have been initiated at other nodes.        7. Establishing an LDP Session

LDP Sessions are configured via management requests which are receivedthrough the UI 66 and forwarded to MPLS Routing 70. The data obtained bythe UI 66 includes the ATM link layer end point of the LDP signallinglink SI (i.e.—line card address, port, VPI/VCI), IP address assigned tothe SI, and LDP specific parameters such as label range, label space IDand keep-alive timeout.

MPLS Routing 70 employs a round-robin algorithm to select oneinstantiation of the LMS 64 (i.e., one of the L3 processors 54) andrequests the associated MPLS CAM 65 to establish a new LDP Session. TheMPLS CAM enables the LDP signalling application on the SI selected bythe network operator and configures the node, including a filteringmechanism (not shown) associated with the L2 processor 50, to allow allLDP packets associated with a particular LDP signalling SI to bepropagated (in both the ingress and egress directions) between the linecards 12 and the selected LMS/L3 processor 54. Once this is carried out,the LMS 64 sends out LDP session establishment messages to the LDP peerrouter in accordance with the applicable label distribution protocol(e.g., LDP Protocol, CRLDP, RSVP). These include “hello” and othersession establishment messages.

Once an LDP Session has been established with the LDP peer router, theLMS 64 informs the label manager 62 of the negotiated label range forthe LDP Session (which is a function of establishing an LDP Session asper the draft standards). The LMS 64 also passes the IP address of theLDP peer router to MPLS Routing 70 which stores this address in therouter ID field 104 a of the LSLT100. In addition, the LMS 64 passes theinterface index identifying the LDP signalling SI to MPLS Routing 10which stores it in the if Index field 108 a of the LSLT 100.

8. Establishing an SLSP

8.1 Procedures at the Ingress Node

Referring to the reference network, an SLSP must be explicitlyestablished at node A for FEC Z by the network operator via the NMTI ofnode A or via the NMS which communicates with node A. The instruction toconfigure the SLSP includes as one of its parameters Z, i.e., thedestination IP address and prefix thereof for FEC Z. The command isreceived and interpreted by the UI 66.

The UI 66 selects a unique LSP ID which, as previously discussed,preferably comprises a concatenation of the node's IP router ID and aunique number. The UI 66 then requests MPLS Routing 70 to create an SLSPfor FEC Z and associate it with the selected LSP ID.

MPLS Routing 70 requests next hop information for FEC Z from IP Routing68. This will occur for non-source-routed LSPs in order to obtain thenext-hop information as well as for source-routed LSPs in order toverify the information in the source-route (which will be supplied bythe network operator). More specifically, MPLS Routing 70 executes thefollowing procedure to initiate the establishment of an SLSP for thisnew FEC.

Referring additionally to FIG. 9, at a first step 150 MPLS Routing 70searches the FIT 110 for an existing entry 112 having the same IPdestination address and prefix as FEC Z. If such an entry exists in theFIT 110 then at step 152 MPLS Routing 70 returns with a failure codeindicating that FEC Z has already been established from this node. Atstep 158, MPLS Routing 70 creates a new FIT entry 112 and appends it tothe FIT 110. A corresponding entry 126 is also inserted into the LSPlist 124 for FEC Z in the RWT hash table 122. If necessary, MPLS Routing70 adds a new entry 122 to the RWT 120 which includes the IP prefix andaddress of FEC Z, or the IP prefix and address of the first hop in theexplicit route.

At step 160 MPLS Routing 70 requests IP Routing 68 to provide the peerIP address for the next hop to reach FEC Z (or the destination node'srouter id for non source-routed RSVP, or the next hop in the configuredsource-route for loose source-routed CR-LDP and RSVP). Once obtained, atstep 162 MPLS Routing 70 searches for an LSLT entry 102 which matchesthe next hop router ID. If a matching LSLT entry exists, then at step164 MPLS Routing 70 selects an available LDP Session from thecorresponding LDP Session list 106. This is a circular linked list,which is managed such that the *ldp_session_list pointer 104 b in theLSLT entry 102 points to the LDP Session to be used for the next SLSPsetup which is selected by MPLS Routing 70. Once the LDP Session isselected, the recently created FIT entry 112 for FEC Z is linked (viathe **prev_fitEntry and *next-FitEntry pointers 112 a and 112 i) toother FIT entries using the same LDP Session.

The *next_ldp_session pointer 108 d points to the next session in theLDP session list. (If there is only one LDP Session in the list then the*next_ldp_session points to itself.) Once the link between the FIT 110and LDP session list 106 is created, MPLS Routing 70 updates the*ldp_session_list pointer 104 b to point to the next session in the LDPsession list with resources. This results in a round robin approach toselecting LDP Sessions for a given FEC. If no sessions to the peer LDProuter have resources, the ldp_session_list pointer 104 b is notupdated. In this case, the list is traversed once when a path is setupbefore MPLS Routing 70 stops looking for a session.

Note also that if MPLS Routing 70 does not find an LSLT entry 102 whichmatches the next hop router ID, then no LDP signaling link existsthereto. In this case MPLS Routing 70 adds the recently created FITentry for FEC Z to the RTL at step 166 and returns at step 168 with anappropriate failure code.

Once an LDP Session has been selected to signal the establishment of theSLSP, then at step 170 MPLS Routing 70 requests the LMS 64 to signal theset up of an SLSP. The LMS 64 of node A sends a label request message,as per the draft LDP standards, to its downstream LDP peer router, nodeB, indicating the desire to set up an LSP for FEC Z. The label requestmessage is propagated downstream across the MPLS routing domain inaccordance with the routing protocol (hop-by-hop or source routed) tothe egress node C, and label mapping messages are propagated upstreamback to the ingress node A. Ultimately, as shown in FIG. 10, a labelmessage should be received inbound on the LDP signalling link selectedby MPLS Routing 70 for FEC Z. This label message identifies the label,i.e., VPI/VCI value, that should be used to forward IP packets and theATM cells thereof to node B. The label is passed to MPLS Routing 70 andto the label manager 62. In addition, at step 174 the LMS 64 signals thecall processor 72 to configure an egress interface index for the SIbeing used on the egress line card and port to handle the data traffic.(Note that the egress line card will be the same line card and portassociated with the LDP signaling SI for FEC Z.) This “binds” FEC Z tothe ATM VPI/VCI label. The binding is reported to MPLS Routing 70 whichsearches the FIT 110 at step 176 for the entry 112 matching FEC Z,whereupon the ifIndex field 112 e is updated with the egress interfaceindex obtained from the call processor 72.

In addition, MPLS Routing 70 updates the fecStatus field 112 f (FIG. 8B)by setting the retrySeq and retrySec counters to zero and sets theingressSetup flag to one thereby indicating successful set up. At step178 MPLS Routing 70 informs IP Routing 68 about the newly establishedSLSP and its egress interface index whereupon the latter task updatesits IP forwarding table 75 (FIG. 6) to add the newly established egressinterface index (shown schematically by ref no. 76) to the appropriatelist 75 c. IP Routing 68, in turn, may have a number of potential egressinterface indexes in list 75 c, which may be used to forward a packet.In order to decide amongst these alternatives, IP Routing 68 employs apriority scheme which grants an MPLS-enabled egress interface index(there can only be one per FEC) higher priority than non-MPLS egressinterfaces. The priority scheme is carried out through the mechanism ofa bit map 75 d (only one shown) which is associated with each entry ofthe egress interface index list 75 c. The bit map 75 c indicates whattype of application, e.g., SLSP or IP, is associated with the egressinterface index entry. Following this priority scheme, at step 180 IPRouting downloads the newly created egress interface index 76 to theforwarding tables 30 of each IP forwarding module. (Table 30 only listsa single egress interface index for each IP address or prefix thereof).Asynchronously, MPLS Routing 70 also informs the UI 66 at step 182 thatthe ingress SLSP for FEC Z has been successfully created.

In the event that no label mapping message is received within apredetermined time period, or the signalling message that is receivedfrom node B denies the setup of an SLSP for FEC Z, the LMS 64 informsMPLS Routing 70 of the failure at step 184. MPLS Routing consequentlyplaces the FIT entry 112 for FEC Z on the RTL 116, sets the fecStatusingressSetup field (FIG. 8B) to zero and increments the value of theretrySeq field (up to a max of 6). At step 186, MPLS Routing informs theUI 66 of the failure.

The retry mechanism for FIT entries is a linear back off mechanism whichcauses an SLSP path setup to be retried at 10, 20, 30, 40, 50, and 60seconds. There is one retry timer associated with MPLS Routing 70 whichgoes off every 10 seconds. At this point MPLS Routing traverses the RTL116, decrementing the amount of time (retrySec—FIG. 8B) left for eachFIT entry 112 in the RTL 116. If the retrySec value is zero, the FITentry 112 is removed from the RTL 116, the retry sequence number isincremented by one and another attempt is made to establish the ingressSLSP. If the retry is successful retrySeq is set to zero and theingressSetup flag is set to 1. If the retry is unsuccessful then the FITentry is added back to the RTL, retrySeq is incremented (max. sequencenumber is preferably 6). When the retrySeq counter is increased, thetime period within which MPLS Routing 70 will retry to set up the SLSPalso increases to the next highest interval. For instance, when retrySeqincreases from 2 to 3 the time interval between retries increases from20 to 30 seconds, i.e. retrySec is set to 30. When retrySeq is equal to6, retries are 60 seconds apart.

8.2 Procedures at Transit Nodes

At transit node B, a label request message for FEC Z is received on MPLSsignaling link 84 and forwarded by the L2 processor 50 to theresponsible LMS 64. The LMS 64 requests next hop information from MPLSRouting 70 which, in turn, retrieves the next hop router ID for FEC Zfrom IP Routing 68, stores the next hop router ID in the RWT 120,selects a downstream LDP Session to the next hop LDP peer router, nodeC, and supplies this data to the LMS 64, as discussed previously. TheLMS 64 then requests the label manager 62 to reserve a VPI/VCI labelfrom within the negotiated label range (determined when the LDP Sessionwith the upstream node A was established). This label is forwardedupstream to node A when the label mapping message is sent thereto Then,if necessary, the LMS 64 which received the upstream label requestmessage will signal another instantiation of the LMS (on a different L3processor 54) responsible for the downstream LDP Session in order toprogress the Label Request message to node C.

When a label mapping message is received from the downstream signallinglink, the LMS 64 signals the call processor 72 to establish across-connect between the label, i.e., VPI/VCI, associated with upstreamnode A and the label, i.e., VPI/VCI, associated with the downstream nodeC to thereby establish downstream data flow. On the transit node thisresults in an ATM style cross-connect, as discussed above. In addition,the LMS 64 responsible for the upstream LDP Session to node A forwards alabel mapping message to it with the label previously reserved by thelabel manager 62.

Note that for source-routed SLSPs it may not be necessary for thetransit node B to obtain next hop information from IP Routing 70. Thisis, however, a preferred feature which enables the transit node toconfirm through its internal routing tables that the next hop providedin the source route list is accurate (e.g., by checking whether the nexthop is listed under the requested IP destination address or prefix). Ifthe explicitly routed next hop cannot be confirmed, then an error can bedeclared.

8.3 Procedures on Egress Node

On the egress node C, a label request message is received on theupstream signalling link with node B and forwarded by the L2 processor50 to the responsible LMS 64. The LMS 64 requests next hop informationfrom MPLS Routing 70 which, in turn, requests next hop information fromIP Routing 68. In this case, however, one of the following circumstancesarises: (1) the next hop router ID returned by IP Routing 68 is thecurrent node, or (2) the next hop is found, but no LDP Session exists tothe next hop (i.e., the edge of the MPLS domain is reached). In eitherof these cases, MPLS Routing 70 informs the LMS 64 that the SLSP for FECZ must egress at this node, whereby the LMS 64 sends a label mappingmessage to the upstream node B as previously described but does not (andcannot) progress the label request message for FEC Z forward. In thiscase, MPLS Routing 70 adds an entry 126 in the RWT 120, as previouslydiscussed, but also adds the newly created RWT entry 126 to the LET 130.

In this case, the LMS 64 instructs the call processor 72 to establish anSI configured for IP forwarding. This SI has an ATM endpoint (i.e.,VPI/VCI) equal to the VPI/VCI used as the MPLS label between nodes B andC for the SLSP.

9. Switching/Routing Activity

Having described the set up of an SLSP for FEC Z, the manner in which IPpackets associated with FEC Z are processed is now briefly described. Atthe ingress node A the IP packets arrive at port 14A1 in the form ofplural ATM cells which the IP forwarder 22A reassembles into constituentIP packets. Once the destination IP address of the received packet isknown, the IP forwarder 22A examines its forwarding table 30 for the“closest” entry. This will be the entry for FEC Z that was downloaded byIP Routing 68 in connection with the establishment of the SLSP for FECZ. Thus, the forwarding table 30 provides the egress interface index 76,comprising the identity or address of the egress line card 12B, egressport 14B1 and egress SI number. The egress interface index is attachedto the packet. The ingress IP forwarder 22A also selects a TI 18 totransport the packet over the switching fabric 20 to the egress IPforwarder 22B, based in part on the COS field encapsulated in thepacket. The packet is then re-segment for transport across the switchingfabric 20 on the selected TI 18 and received by the egress IP forwarder22B. The egress IP forwarder 22B, in turn, extracts the egress SI andCOS information attached to the packet and modifies it to match theencapsulation indicated by the egress interface index (i.e., egress SI).This includes attaching the VPI/VCI label to the packet. The packet issubsequently segmented into constituent ATM cells and transmitted out ofthe egress port 14B1 with the VPI/VCI values indicated by the egress SI.

On the transit node B, the ATM cells corresponding to the IP packets arereceived by an ingress port. The CAM 15 returns an ATM egress connectionindex, whereby the cells are processed as ATM cells. The ingress linecard 12A also attaches internal addressing information retrieved fromthe CAM 15A to each cell, thereby enabling the cells to be routed to theegress line card which replaces the VPI/VCI value of the cells. Theegress line card then transmits the cell using the new VPI/VCI value.Note that in this case the IP forwarding modules 22 were not involved inthe switching activity and there was no need to re-assemble andre-segment the IP packet, or perform the IP routing lookup.

On the egress node C, the ATM cells corresponding to the IP packets arereceived by an ingress port and processed in accordance with the SIconfigured for the VPI/VCI carried by the cells. This SI is configuredsuch that the cells are sent to the IP forwarding module 22A forre-assembly into the higher-layer IP packets and thereafter processed asregular IP packets.

10. Network Topology Changes

10.1 New LDP Session

When a new LDP Session is established on node 10, the LMS 64 signalsMPLS Routing 70 about this event and informs it about the interfaceindex for the new LDP Session. The signal arises whether the node is theinitiator of the new LDP Session the respondent. Referring additionallyto the flow chart of FIG. 11, at step 190 MPLS Routing searches for thepeer router ID IP address in the LSLT 100. If an LSLT entry 194 for thisrouter is found, then at step 192 MPLS Routing 70 examines thecorresponding LDP Session list 106 to ensure that no entries 108 existfor an LDP Session having the same interface index as the new LDPsession. If no such entry is found, a new entry 108 is created at step195. If such an entry is found, an error is returned. If no LSLT entry104 is found which matches the peer router ID for the newly configuredLDP Session, then at step 194 MPLS Routing creates and inserts a newLSLT entry 104, following which the LDP session list entry 106 iscreated at step 195.

At step 196, MPLS Routing 70 traverses the LET 130. For each RWT entry126 belonging to the LET, the corresponding FEC is determined from hashtable 122, and at step 200 the next hop router ID for that FEC isrequested from IP Routing 68. At step 201 the next hop router ID iscompared against the peer router ID of the newly configured LDP Session.If no match is found, control returns to step 198, and if a match isfound, control passes to step 202. At step 202, MPLS Routing 70instructs the LMS 64 to send a label request message to the newlyreachable peer router for the identified FEC.

10.2 Signaling Link Failure

When an LDP Session fails on a node it stops forwarding all SLSPs usingthe associated VPI/VCI range (stored in the label manager 62) andremoves the cross-connects from the node. The node also sends a labelwithdraw message to the upstream peer for each SLSP associated with thefailed LDP Session. For instance, if the MPLS link 84BC (FIG. 7) fails,node B sends a label withdraw regarding FEC Z to the ingress node A.When the label withdraw message is received at the ingress node A, itstops using the path (IP hop-by-hop forwarding is used instead) andimmediately re-initiates the steps described previously to re-establisha path for FEC Z. If this does not succeed, then the SLSP for FEC Z isplaced on the RTL 116 following which the retry procedures as previouslydescribed are effected.

Furthermore, when an LDP Session becomes inoperative in the ingress nodeA for whatever reason, the LMS 64 informs MPLS Routing 70. As part ofthis call, the LMS 64 provides MPLS Routing 70 with the peer router IDIP address. MPLS Routing 70 then searches for the peer IP address in therouter ID field 104 a of the LSLT 100. If there is no entry for the peerIP address, an error is returned. If there is an entry 104 a for thepeer IP address, the corresponding session list 106 is searched for thefailed LDP Session. If there is a matching LDP Session entry 108, it isremoved from the session list 106.

The *fit_list_entry pointer 108 b of the removed session list entry 106points to the list of all FIT entries 112 representing all ingress SLSPsusing the failed LDP Session. For each of these entries, MPLS Routing 70immediately tries to re-establish the ingress SLSP as described above tosee if there is an alternate LDP Session that may be used to set up theingress SLSP. If the retry is unsuccessful, the ingress SLSP goes on theRTL 116 and the retry procedures outline above are followed.

10.3 IP Routing Changes

Over the course of time, IP Routing 68 may discover a new next hop forFEC Z. For example, in the reference network IP Routing on node B maydiscover that the next hop for FEC Z should be node D (not shown). Uponsuch a discovery, IP Routing 68 on node B informs MPLS Routing 70 of thenew next hop router ID for FEC Z. MPLS Routing 70 uses the followingprocess to re-route the SLSP for FEC Z: First, it searches for a RWTentry 122 matching the IP prefix address, e.g., FEC Z, which has changedin the IP Routing table 75. In the event no entry 122 is found MPLSRouting returns otherwise it continues and next searches for an LSLTentry 104 that matches the router ID of the new next hop D. If there isan LSLT entry 104 and hence LDP Session to the new router D, MPLSRouting requests the LMS 64 to progress each transit SLSP in the RWTlist 124 pointed to by the matching RWT entry 122 using the LDP Sessionto router D. Thus transit SLSPs are re-routed to the new next hop routerD. However, if there is no LSLT entry 102 for the router ID of the newnext hop and hence no LDP Session therefor, then MPLS Routing 70 placeseach transit SLSP in the RWT list 124 corresponding to the old-hoprouter on the LET 130 and informs the LMS 64 that it should considersuch SLSPs as egress SLPs. The LMS 64, in turn, instructs the callprocessor 72 to set up egress SIs for the egress SLSPs.

MPLS Routing 70 also searches for a FIT entry 112 which matches theaffected FEC. If there is a FIT entry 112 that matches the FEC and theingress_setup flag of the fec-status field 112 f is non zero (i.e., thepath is set up), MPLS Routing 70 requests that the LMS 64 close theingress SLSP by sending a label release message to the downstreamrouters. MPLS Routing 70 then searches for an LSLT entry 104 a thatmatches the router ID IP address for the new next hop. If there is suchan LSLT entry, then an LDP Session is selected from the correspondingLDP session list 106, and the procedures for establishing an ingressSLSP are followed as described above.

10.4 Physical Link Failure

When a physical link between two nodes fail, then signaling links 82 and84 (see FIG. 7) for both MPLS signaling and IP routing fail. In thepresent embodiment, IP Routing 68 realizes that the link is down andupdates its routing table 75 before the LMS 64 realizes that any LDPSessions thereover are down. This is accomplished by suitably setting“time out” periods for LDP Sessions and signaling sessions in IP Routingsuch that interface failures are reflected much quicker into IP Routing68 than MPLS Routing 70. Accordingly, IP Routing 68 informs MPLS Routing70 about a new next hop router ID for affected SLSPs and as previouslydescribed MPLS Routing 70 will reroute these SLSP paths from the currentnode, using the new next hop router identified by IP Routing 68. This ismore efficient than tearing down the affected SLSPs back to the ingressnode and resignaling them as would have occurred if MPLS Routing 70realizes the signaling link is down.

The foregoing embodiment has been described with a certain degree ofparticularity for the purposes of description. Those skilled in the artwill understand that numerous variations and modifications may be madeto the embodiments disclosed herein without departing from the spiritand scope of the invention.

1. A method for setting a timing interval between attempts to establisha label switched path (LSP) between an ingress node and an egress nodeof a communication network, comprising: a) defining a uniqueidentification (LSP ID) for said LSP and establishing a signalling linkbetween said ingress and egress nodes; b) at said ingress node,monitoring said signalling link to detect a message indicating that saidLSP has been established; c) initiating from said ingress node a newattempt to establish said LSP after a retry time interval from aprevious attempt, if said ingress node did not receive said messageindicating that said LSP has been established from said signalling link;and, d) repeating step c) after a different retry time interval, saiddifferent retry time interval being greater than said retry timeinterval.
 2. The method of claim 1 wherein said different retry timeinterval is greater than said retry time interval by a fixed time value.3. The method of claim 1 wherein said step c) further comprisesproviding at said ingress node a retry timer based on a linear back-offmechanism for enabling successive attempts to establish said LSP atincreasing retry time intervals.
 4. The method of claim 3 wherein saidretry timer provides T seconds between said new attempt and saidprevious attempt and wherein each next successive retry time interval islonger than a respective previous retry time interval by said T seconds.5. The method of claim 1 wherein a total retry time for all successiveattempts to establish said LSP does not exceed a maximum time value. 6.The method of claim 1 wherein said LSP is a soft permanent LSP.
 7. Themethod of claim 4 wherein said T seconds is ten seconds.
 8. The methodof claim 5 wherein said maximum time value is sixty seconds.
 9. A methodfor establishing label switched paths (LSPs) across a communicationnetwork, comprising: i) maintaining at a first node of saidcommunication network a list of records including all said LSPs to beestablished from said first node; ii) selecting from said list ofrecords a first record for a particular LSP of said LSPs to beestablished, and establishing a first signalling link between said firstnode and an egress node for said particular LSP; iii) monitoring at saidfirst node for messages indicating that said particular LSP has beenestablished; and, iv) if said particular LSP has been established,marking said first record as being successful.
 10. The method of claim 9and further comprising: v) initiating from said first node a new attemptto establish said particular LSP after a retry time interval from aprevious attempt, if said ingress node did not receive said messageindicating that said particular LSP has been established from said firstsignalling link; and, vi) repeating said step v) after a different retrytime interval having an interval greater than said retry time interval.11. The method of claim 10 wherein said step v) further comprisesestablishing at least a second signalling link between said ingress andegress node and selecting one of said first and said second signallinglinks utilizing a round-robin algorithm.
 12. The method of claim 11 andfurther comprising not selecting any of said first and second signallinglinks whenever said network does not have sufficient resources forestablishing signalling links.
 13. The method of claim 10 wherein saidstep ii) further comprises: providing each record in said list ofrecords with a time field holding a respective time value; decrementingsaid time value for each record in said list of records at regularintervals of time; and, selecting said LSP when the time value in saidtime field for said first record reaches zero.